Almost affinely disjoint subspaces

نویسندگان

چکیده

In this work, we introduce a natural notion concerning finite vector spaces. A family of k-dimensional subspaces Fqn, which forms partial spread, is called almost affinely disjoint if any (k+1)-dimensional subspace containing from the non-trivially intersects with only few family. The central question discussed in paper polynomial growth (in q) maximal cardinality these families given parameters k and n. For cases k=1 k=2, optimal are constructed. other settings, find lower upper bounds on growth. Additionally, some connections problems coding theory shown.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Self-Bounded Controlled-Invariant Subspaces and Almost Disturbance Decoupling

The objective of this contribution is to characterize the so-called finite fixed poles of the Almost Disturbance Decoupling Problem by state feedback (ADDP) ′ . The most important step towards this result relies on the extension to almost invariant subspaces of the key notion of self-boundedness, as initially introduced by Basile and Marro for perfect controlled-invariants, namely, we introduce...

متن کامل

Confinitary Groups, Almost Disjoint and Dominating Families

In this paper we show that it is consistent with ZFC that the cardinality of every maximal cofinitary group of Sym(ω) is strictly greater than the cardinal numbers d and a.

متن کامل

Satisfiability of Almost Disjoint CNF Formulas

We call a CNF formula linear if any two clauses have at most one variable in common. Let m(k) be the largest integer m such that any linear k-CNF formula with ≤ m clauses is satisfiable. We show that 4 k 4e2k3 ≤ m(k) < ln(2)k4. More generally, a (k, d)-CSP is a constraint satisfaction problem in conjunctive normal form where each variable can take on one of d values, and each constraint contain...

متن کامل

Almost Disjoint Triangles in 3-Space

Two triangles are called almost disjoint if they are either disjoint or their intersection consists of one common vertex. Let f (n) denote the maximum number of pairwise almost disjoint triangles that can be found on some vertex set of n points in 3-space. Here we prove that f (n) = (n3/2).

متن کامل

Invariance properties of almost disjoint families

We answer a question of Gracia-Ferreira and Hrušák by constructing consistently a MAD family maximal in the Katětov order. We also answer several questions of Garcia-Ferreira.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2021

ISSN: ['1090-2465', '1071-5797']

DOI: https://doi.org/10.1016/j.ffa.2021.101879